Mechanized Refinement of Communication Models with TLA ^+ +
نویسندگان
چکیده
In distributed systems, asynchronous communication is often viewed as a whole whereas there are actually many di erent interaction protocols whose properties are involved in the compatibility of peer compositions. A hierarchy of asynchronous communication models, based on re nements, is established and proven with the TLA Proof System. The work serves as a rst step in the study of the substituability of the communication models when it comes to compatibility checking.
منابع مشابه
Verifying and Constructing Abstract TLA Specifications: Application to the Verification of C programs
One approach to verify the correctness of a system is to prove that it implements an executable (specification) model whose correctness is more obvious. Here, we define a kind of automata whose state is the product of values of multiple variables that we name State Transition System (STS). We define the semantics of TLA+ (specification language of the Temporal Logic of Actions) constructs using...
متن کاملTeaching Transition Systems and Formal Specifications with TLA
We present here our experience with teaching two courses using TLA. The first course concerns state transition systems, and the second one is about formal specifications. In the first course, TLA is used to describe, reason about, and analyze transition systems. The second course deals with refinement, simulation and bisimulation, and TLA is used to check refinements.
متن کاملStepwise Refinement Validation of Design Patterns Formalized in TLA+ using the TLC Model Checker
Spec ∆ = Abstract !Spec This is P ’s specification theorem Spec ⇒ AbstractSpec Spec is Q ’s specification Figure 2: Structure of a TLA+ refinement of patterns
متن کاملFeature Interactions: A Mixed Semantic Model Approach
The feature interaction problem is prominent in telephone service development. Through a number of case studies, we have discovered that no one semantic framework is suitable for the synthesis and analysis of formal feature requirements models. We illustrate our mixed-model approach, where we use OO LOTOS, B and TLA+ in a complementary fashion. A simple combination of call forwarding and call s...
متن کاملRefinement Types for tla +
TLA is a specification language, mainly intended for concurrent and distributed systems. Its non-temporal fragment is based on a variant of (untyped) ZF set theory. Motivated by the integration of the TLA Proof System with SMT solvers or similar tools based on multi-sorted first-order logic, we define a type system for TLA and we prove its soundness. The system includes refinement types, which ...
متن کامل